Symposium on Matching and Meaning Workshop on Matching and Meaning Programme Chairs
نویسنده
چکیده
In this paper, we present a method for assigning examplesentences to each sense of words in WordNet. The key idea is thatthe method assigns each sense of a word w collected from not onlythe sentences containing w, but also sentences containing words withsemantically related to w. Because a collection of a context of thetarget word w is a similar syntactic behavior, even collected from avery very large corpora. The evaluation result showed that example-assignment based on groups of similar words significantly improvedthe retrieval of context for word sense, which helps to determine theexact definition of polysemous words.
منابع مشابه
PRIMA - Towards an Automatic Review/Paper Matching Score Calculation
Programme chairs of scientific conferences face a tremendous time pressure. One of the most time-consuming steps during the conference workflow is assigning members of the international programme committee (IPC) to the received submissions. Finding the best-suited persons for reviewing strongly depends on how the paper matches the expertise of each IPC member. While various approaches like ”bid...
متن کاملDeterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solom...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملEvaluating Scoped Meaning Representations
Semantic parsing offers many opportunities to improve natural language understanding. We present a semantically annotated parallel corpus for English, German, Italian, and Dutch where sentences are aligned with scoped meaning representations in order to capture the semantics of negation, modals, quantification, and presupposition triggers. The semantic formalism is based on Discourse Representa...
متن کاملComputing as Compression by Multiple Alignment, Unification and Search (1) J
This article and its companion17) develop the idea that computing in some deep sense may be understood as a process of information compression by multiple alignment, with a meaning which is close to the meaning of that term in bio-informatics, unification, meaning the merging of two more copies of any pattern to make one, and metrics-guided search. These proposals are the latest phase in a prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009